A Graph-Based Inference Method for Conditional Independence
نویسنده
چکیده
The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 1988]. Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition. This paper explores a representation for independence statements using multiple undirected graphs and some simple graphical transformations. The independence statements derivable in this system are equivalent to those obtainable by the graphoid axioms. Therefore, this is a purely graphical proof technique for conditional independence.
منابع مشابه
A New Inference Axiom for Probabilistic Conditional Independence
In this paper, we present a hypergraph-based inference method for conditional independence. Our method allows us to obtain several interesting results on graph combination. In particular, our hypergraph approach allows us to strengthen one result obtained in a conventional graph-based approach. We also introduce a new inference axiom, called combination, of which the contraction axiom is a spec...
متن کاملCumulative distribution networks: Inference, estimation and applications of graphical models for cumulative distribution functions
Cumulative distribution networks: Inference, estimation and applications of graphical models for cumulative distribution functions Jim C. Huang Doctor of Philosophy Graduate Department of Electrical and Computer Engineering University of Toronto 2009 This thesis presents a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variabl...
متن کاملRestricted Structural Equation Models for Causal Inference
Causal inference tries to solve the following problem: given i.i.d. data from a joint distribution, one tries to infer the underlying causal DAG (directed acyclic graph), in which each node represents one of the observed variables. For approaching this problem, we have to make assumptions that connect the causal graph with the joint distribution. Independence-based methods like the PC algorithm...
متن کاملA Method for Constructing the Dependency Structure of a Probabilistic Network
Probabilistic reasoning has become an accepted formulism for managing uncertainty in Artiicial Intelligence. The usual input to a probabilistic model is a Bayesian network containing both embedded and nonembed-ded conditional independence information. A Bayesian network comprises a qualitative and a quantitative component, namely a directed acyclic graph explicitly specifying the dependency str...
متن کاملEfficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transform (sets of) CI statements into certain integral vectors and to verify by a computer the corresponding algebraic relation between the vectors, called the independence implication. We interpret the previous methods for c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991